Combining Adaboost with a Hill-climbing Evolutionary Feature Search for Efficient Training of Performant Visual Object Detectors
نویسنده
چکیده
This paper presents an efficient method for automatic training of performant visual object detectors, and its successful application to training of a back-view car detector. Our method for training detectors is adaBoost applied to a very general family of visual features (called “control-point” features), with a specific feature-selection weak-learner: evo-HC, which is a hybrid of Hill-Climbing and evolutionary-search. Very good results are obtained for the car-detection application: 95% positive car detection rate with less than one false positive per image frame, computed on an independant validation video. It is also shown that our original hybrid evo-HC weak-learner allows to obtain detection performances that are unreachable in reasonable training time with a crude random search. Finally our method seems to be potentially efficient for training detectors of very different kinds of objects, as it was already previously shown to provide state-of-art performance for pedestriandetection tasks.
منابع مشابه
A Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem
This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...
متن کاملGenetic Algorithms: Combining Evolutionary and `Non'-Evolutionary Methods in Tracking Dynamic Global Optima
The ability to track dynamic functional optima is important in many practical tasks. Recent research in this area has concentrated on modifying evolutionary algorithms (EAs) by triggering changes in control parameters, ensuring population diversity, or remembering past solutions. A set of results are presented that favourably compare hill climbing with a genetic algorithm, and reasons for the r...
متن کاملThe Eeects of Randomly Sampled Training Data on Program Evolution the Eeects of Randomly Sampled Training Data on Program Evolution
The eeects of randomly sampled training data during genetic programming is empirically investigated. Sometimes the most natural , if not only, means of characterizing the target behaviour for some problems is to randomly sample training cases inherent to the problems in question. A natural question to raise about this strategy is, how delete-rious is the randomly sampling of training data to ev...
متن کاملThe E ects of Randomly Sampled Training Data on
The eeects of randomly sampled training data on genetic programming performance is empirically investigated. Often the most natural, if not only, means of characterizing the target behaviour for a problem is to randomly sample training cases inherent to that problem. A natural question to raise about this strategy is, how deleterious is the randomly sampling of training data to evolution perfor...
متن کاملHill-climbing Search in Evolutionary Models for Protein Folding Simulations
Evolutionary algorithms and hill-climbing search models are investigated to address the protein structure prediction problem. This is a well-known NP-hard problem representing one of the most important and challenging problems in computational biology. The pull move operation is engaged as the main local search operator in several approaches to protein structure prediction. The considered appro...
متن کامل